Completeness of Hoare logic with inputs over the standard model
نویسندگان
چکیده
منابع مشابه
Completeness of Hoare Logic over Nonstandard Models
The nonstandard approach to program semantics has successfully resolved the completeness problem of Floyd-Hoare logic. The known versions of nonstandard semantics, the Hungary semantics and axiomatic semantics, are so general that they are absent either from mathematical elegance or from practical usefulness. The aim of this paper is to exhibit a not only mathematically elegant but also practic...
متن کاملOn Completeness Results of Hoare Logic Relative to the Standard Model
The general completeness problem of Hoare logic relative to the standard model N of Peano arithmetic has been studied by Cook, and it allows for the use of arbitrary arithmetical formulas as assertions. In practice, the assertions would be simple arithmetical formulas, e.g. of a low level in the arithmetical hierarchy. In addition, we find that, by restricting inputs to N , the complexity of th...
متن کاملOn the Completeness of Propositional Hoare Logic
As shown by Cook [5], Hoare logic is relatively complete for partial correctness assertions (PCAs) over while programs whenever the underlying assertion language is sufficiently expressive. The expressiveness conditions in Cook’s formulation provide for the expression of weakest preconditions. These conditions holds for first-order logic over , for example, because of the coding power of first-...
متن کاملHoare logic and VDM : machine-checked soundness and completeness proofs
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Many incorrect results have been published in the past. We take advantage of the computer-aided proof tool LEGO to interactively establish soundness and completeness of both Hoare Logic and the operation decomposition rules of the Vienna Development Method (VDM) with resp...
متن کاملAbout Strong Standard Completeness of Product Logic
Propositional Product Logic is known to be standard finite-strong complete but not a strong complete, that is, it is complete for deductions only from finite sets of premises with respect to evaluations on the standard product chain over the real unit interval. On the other hand, Montagna has defined a logical system, an axiomatic extension of the Hájek’s Basic Fuzzy Logic BL with an storage op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.08.004